On Extra Variables in (Equational) Logic Programming
نویسنده
چکیده
Extra variables in a clause are variables which occur in the body but not in the head. It has been argued that extra variables are necessary and contribute to the expressive power of logic languages. In the first part of this paper, we show that this is not true in general. For this purpose, we provide a simple syntactic transformation of each logic program into a logic program without extra variables. Moreover, we show a strong correspondence between the original and the transformed program with respect to the declarative and the operational semantics. In the second part of this paper, we use a similar technique to provide new completeness results for equational logic programs with extra variables. In equational logic programming it is well known that extra variables cause problems since narrowing, the standard operational semantics for equational logic programming, may become incomplete in the presence of extra variables. Since extra variables are useful from a programming point of view, we characterize new classes of equational logic programs with extra variables for which narrowing and particular narrowing strategies are complete. In particular, we show the completeness of narrowing strategies in the presence of nonterminating functions and extra variables in right-hand sides of rewrite rules.
منابع مشابه
Max-planck-institut F Ur Informatik on Extra Variables in (equational) Logic Programming
Extra variables in a clause are variables which occur in the body but not in the head. It has been argued that extra variables are necessary and contribute to the expressive power of logic languages. In the rst part of this paper, we show that this is not true in general. For this purpose, we provide a simple syntactic transformation of each logic program into a logic program without extra vari...
متن کاملCategory-based Semantics for Equational and Constraint Logic Programming
This thesis proposes a general framework for equational logic programming, called catf:gory based equational logic by placing the general principles underlying the design of the pro gramming language Eqlog and formulated by Goguen and Meseguer into an abstract form. This framework generalises equational deduction to an arbitrary category satisfy ing certain natural conditions; completeness i...
متن کاملCompleteness of Category-Based Equational Deduction
Equational deduction is generalised within a category-based abstract model theory framework, and proved complete under a hypothesis of quantiier projectivity, using a semantic treatment that regards quantiiers as models rather than variables, and regards valuations as model morphisms rather than functions. Applications include many and order sorted conditional] equational logics, Horn clause lo...
متن کاملOn the Completeness of Narrowing as the Operational Semantics of Functional Logic Programming
In our previous work Go&al 91] we used a restricted kind of applicative rewriting systems as computational model for higher-order (HO) lazy functional programming, and we proved soundness and completeness of innnite rewriting w.r.t. a declarative semantics, in the spirit of logic programming. The aim of this paper is to present similar results for functional logic programming. We model HO funct...
متن کاملAuthors' Reply2
[5] C. R. Edwards, "A special class of universal logic gate, and their evaluation under the Walsh transform," Int.A consideration of the minimum number of input terminals on universal logic gates, and their realization," Int. J. We would like to thank Hurst for his interest in our correspondence. His comments are addressed to the topic of U.L.M. realization, which has been the subject of consid...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995